Laplacian matrices and Alexandrov topologies of digraphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Properties of Alexandrov Topologies

Alexandrov topologies are the topologies induced by relations. This paper addresses the properties of Alexandrov topologies as the extensions of strong topologies and strong cotopologies in complete residuated lattices. With the concepts of Zhang’s completeness, the notions are discussed as extensions of interior and closure operators in a sense as Pawlak’s the rough set theory. It is shown tha...

متن کامل

Integrating Space, Time, Version, and Scale using Alexandrov Topologies

As a contribution to higher dimensional spatial data modelling this article introduces a novel approach to spatial database design. Instead of extending the canonical Solid-Face-Edge-Vertex schema of topological data, these classes are replaced altogether by a common type SpatialEntity, and the individual “bounded-by” relations between two consecutive classes are replaced by one separate binary...

متن کامل

Join Preserving Maps, Fuzzy Preorders and Alexandrov Fuzzy Topologies

In this paper, we investigate the properties of join preserving maps in complete residuated lattices. We define join approximation operators as a generalization of fuzzy rough sets in complete residuated lattices. Moreover, we investigate the relations between join preserving operators and Alexandrov fuzzy topologies. We give their examples. AMS Subject Classification: 03E72, 03G10, 06A15, 06F07

متن کامل

Laplacian Simplices Associated to Digraphs

We associate to a finite digraph D a lattice polytope PD whose vertices are the rows of the Laplacian matrix of D. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem, we show that the normalized volume of PD equals the complexity of D, and PD contains the origin in its relative interior if and only if D is strongly connected. In...

متن کامل

new skew laplacian energy of simple digraphs

for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2015.04.031